Data protection using universal tagging

ABSTRACT

A universal tag linked to the content of a data file for protecting the authenticity of the data file and/or the owner/creator of a digital file. The universal tag is linked to the content in the data file via one or more input keys/seeds that are used to generate the universal tag and rely on data associated with the content. Once generated, the universal tag is registered on a distributed ledger of at least on distributed trust computing network, which acts as a source of truth to validate the universal tag and, as such, validate (i) an authenticity of the data file, and/or (ii) the user associated with the data file (e.g., rightful possessor and/or creator of the digital file).

FIELD OF THE INVENTION

The present invention is generally directed to data security and, morespecifically, providing data verification via registration of auniversal tag within a distributed trust (e.g., blockchain) computingnetwork.

BACKGROUND

In today's digital world the concern persists that a document or otherdigital work/file may have been tampered with or otherwise compromised.In this regard, the rightful possessor or a wrongful entity may alterthe document or digital work/file for their benefit. For example,parties to signed contract/agreement may desire to nefariously changeterms of the contract/agreement after the contract/agreement has beenentered into or an individual may desire to change information on adigital birth certificate to show a different date of birth or name.Using conventional hacking techniques such changes can be made withoutleaving a footprint on the document or digital work/file (i.e., withoutimpacting the metadata or making known that the document or digitalwork/file has been edited).

Similarly, digital works, such as intellectual property (e.g., music,video books, digital art, formulas, inventions and the like) aresusceptible to wrongful entities either altering the work or claimingthe work as their own. Once again, such alterations can occur withoutabsent changes to the metadata or otherwise indicating that an edit hasoccurred.

Therefore, a need exits to verify and register, upon creation, digitalfiles, such as contracts, purchase agreements, formal documents (e.g.,birth certificates, marriage licenses, and the like), digitalworks/intellectual property (e.g., music, video, books,formulas/inventions and the like). The verification and registration mayinclude verifying the content as well as the creator/author for thepurpose of insuring that any wrongful subsequent altering/changes to thedigital file or claim of ownership/creation of the digital file can beeasily detected and/or disavowed.

BRIEF SUMMARY

The following presents a simplified summary of one or more embodimentsof the invention in order to provide a basic understanding of suchembodiments. This summary is not an extensive overview of allcontemplated embodiments, and is intended to neither identify key orcritical elements of all embodiments, nor delineate the scope of any orall embodiments. Its sole purpose is to present some concepts of one ormore embodiments in a simplified form as a prelude to the more detaileddescription that is presented later.

Embodiments of the present invention address the above needs and/orachieve other advantages by providing systems, methods, computer programproduct and/or the like for protecting the authenticity of data filesand/or the owner/creator of a digital file through creation andregistration of universal tags. As previously discussed many data filesare susceptible to wrongful alteration and/or claims ofownership/creation, the present invention serves to detect and/orprevent such wrongful alteration and/or claims of ownership/creation bygenerating a unique universal tag and registering the universal tag witha distributed trust computing network, which serves as a source oftruth/verification for the universal tag. In this regard, a trustedentity (e.g., government agency, financial institution or the like) mayserve as the entity that generates and registers the universal tag,which serves as the official identifier (e.g., fingerprint, birthmark orthe like) for entire lifecycle of the data file.

In specific embodiments of the invention the universal tag is generatedby implementing a hash algorithm that uses one more input keys as theseed values. In specific embodiments of the invention, the input keysinclude one or more, and in some embodiments all of, (1) a first keycomprising a randomized digital representation of at least a portion ofthe data file, (2) a second key comprising data associated with at leastone selected from the group of (i) the user (e.g., digital signature ofthe user and biometric data and the like), and (ii) an origin of thedata file (e.g., a date, a time and/or a geographic location at whichthe data file was created), and (3) a third key comprising a randomizedinput provided by the validating entity. Once the universal tag isgenerated it is registering through storage within a distributed ledgerof at least one distributed trust computing network. The distributedtrust computing network is configured to verify the universal tag and,in doing so, validates at least one of (i) an authenticity of the datafile, and (ii) the user associated with the data file (e.g., rightfulpossessor and/or creator of the digital file).

A system for data protection provides for first embodiments of theinvention. The system includes at least one distributed trust computingnetwork that includes a plurality of decentralized nodes. Eachdecentralized node has a first memory and at least one first processorin communication with the memory. The first memory of the decentralizednodes is configured to store at least one distributed ledger comprisinga plurality of blocks of data. The system additionally includes acomputing platform disposed in a distributed computing network andincluding a second memory and at least one second processor incommunication with the second memory. The second memory storesinstructions that are executable by the second processor and configuredto receive one or more keys configured for generating a universal taglinked to a data file associated with a user and apply the one or morekeys to a hash algorithm to generate the universal tag. The instructionsare further configured to register the universal tag within a block ofat least one distributed ledger stored or accessible to one or more ofthe at least one distributed trust computing networks. The registeringof the universal tag within the one or more distributed trust computingnetworks provides for validating at least one selected from the group of(i) an authenticity of the data file, and (ii) the user associated withthe data file.

In specific embodiments of the system, the one or more keys include atleast one of, and in specific embodiments all of, (1) a first keycomprising a randomized digital representation of at least a portion ofthe data file, (2) a second key comprising data associated with at leastone selected from the group of (i) the user (e.g., digital signature ofthe user and biometric data and the like), and (ii) an origin of thedata file (e.g., a date, a time and/or a geographic location at whichthe data file was created), and (3) a third key comprising a randomizedinput provided by the instructions or a validating entity.

In other specific embodiments of the system, the data file associatedwith the user is one of (i) a document to which the user is a party to(e.g., contract, birth/marriage certificate, purchase agreement or thelike), or (ii) intellectual property created by the user (e.g.,song/audio, multimedia/video, book, formula or the like).

In other specific embodiments of the system, the instructions arefurther configure to create a coded representation (e.g., bar code, QRcode or the like) of the universal tag, wherein the coded representationis configured to be decoded (e.g., scanned) to provide validation of atleast one selected from the group of (i) the authenticity of the datafile, and (ii) the user associated with the data file. In relatedspecific embodiments of the system the instructions are furtherconfigured to embed the coded representation within digitalreproductions of the data file.

In still further specific embodiments of the system, the instructionsare further configured to apply the universal tag to the hash algorithm(i.e., de-hash) to validate the one or more keys.

A computer-implemented method for data protection defines secondembodiments of the invention. The computer-implemented method isimplemented by one or more processing devices. The method includesreceiving one or more keys configured for generating a universal taglinked to a data file associated with a user and applying the one ormore keys to a hash algorithm to generate the universal tag. The methodfurther includes registering the universal tag within a block of atleast one distributed ledger stored or accessible to one or moredistributed trust computing networks. The registering of the universaltag within the one or more the distributed trust computing networksprovides for validating at least one selected from the group of (i) anauthenticity of the data file, and (ii) the user associated with thedata file.

In specific embodiments of the method receiving one or more keys furtherincludes receiving at least one of, and in some embodiments all of, afirst key comprising a randomized digital representation of at least aportion of the data file, a second key comprising data associated withat least one selected from the group of (i) the user, and (ii) an originof the data file, and/or a third a randomized input provided by theinstructions or a validating entity.

In further specific embodiments the computer-implemented method includescreating a coded representation of the universal tag. The codedrepresentation is configured to be decoded to provide validation of atleast one selected from the group of (i) the authenticity of the datafile, and (ii) the user associated with the data file. In suchembodiments the computer-implemented method may further includeembedding the coded representation within digital reproductions of thedata file.

A computer program product including a non-transitory computer-readablemedium defines third embodiments of the invention. The computer-readablemedium includes a first set of codes for causing a computer to receiveone or more keys configured for generating a universal tag linked to adata file associated with a user. Additionally, the computer-readablemedium includes a second set of codes for causing a computer to applythe one or more keys to a hash algorithm to generate the universal tag.In addition, the computer-readable medium includes a third set of codesfor causing a computer to register the universal tag within a block ofat least one distributed ledger stored or accessible to one or moredistributed trust computing networks. The registering of the universaltag within the one or more the distributed trust computing networksprovides for validating at least one selected from the group of (i) anauthenticity of the data file, and (ii) the user associated with thedata file.

In specific embodiments of the computer program product, the first setof codes is further configured to cause the computer to receive at leastone of selected from the group of receiving (1) a first key comprising arandomized digital representation of at least a portion of the datafile, (2) a second key comprising data associated with at least oneselected from the group of (i) the user, and (ii) an origin of the datafile, and (3) a third key comprising a randomized input provided by avalidating entity.

Thus, according to embodiments of the invention, which will be discussedin greater detail below, the present invention provides for protectingthe authenticity of data files and/or the owner/creator of a digitalfile through generation and registration of universal tag. The universaltags are linked to the content in the data file via one or more inputkeys/seeds that are used to generate the universal tag and rely on dataassociated with the content. Once generated, the universal tag isregistered on a distributed ledger of at least on distributed trust(e.g., blockchain) computing network, which acts as a source of truth tovalidate the universal tag and, as such, validate (i) an authenticity ofthe data file, and/or (ii) the user associated with the data file (e.g.,rightful possessor and/or creator of the digital file).

The features, functions, and advantages that have been discussed may beachieved independently in various embodiments of the present inventionor may be combined with yet other embodiments, further details of whichcan be seen with reference to the following description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

Having thus described embodiments of the disclosure in general terms,reference will now be made to the accompanying drawings, wherein:

FIG. 1 is a schematic diagram of a distributed trust computing network,such as a blockchain network, in accordance with some embodiments of thepresent disclosure;

FIG. 2 is a schematic diagram of a system for data protection usinguniversal tagging, in accordance with some embodiments of the presentdisclosure;

FIG. 3 is a block diagram of a flow for generating and registering auniversal tag linked to a data file, in accordance with some embodimentsof the present disclosure; and

FIG. 4 is a block diagram of a computing platform configured for dataprotection using universal tags linked to data file and, in someembodiments, sporadically generated universal tags, in accordance withsome embodiments of the present disclosure;

FIG. 5 is a flow diagram of a method for data protection using universaltags linked to data files, in accordance with embodiments of the presentinvention; and

FIG. 6 is flow diagram of a method for data protection usingsporadically generated universal tags linked to data files, inaccordance with embodiments of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Embodiments of the present invention will now be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all, embodiments of the invention are shown. Indeed, theinvention may be embodied in many different forms and should not beconstrued as limited to the embodiments set forth herein; rather, theseembodiments are provided so that this disclosure will satisfy applicablelegal requirements. Like numbers refer to like elements throughout.

As will be appreciated by one of skill in the art in view of thisdisclosure, the present invention may be embodied as a system, a method,a computer program product or a combination of the foregoing.Accordingly, embodiments of the present invention may take the form ofan entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.), or anembodiment combining software and hardware aspects that may generally bereferred to herein as a “system.” Furthermore, embodiments of thepresent invention may take the form of a computer program productcomprising a computer-usable storage medium having computer-usableprogram code/computer-readable instructions embodied in the medium.

Any suitable computer-usable or computer-readable medium may beutilized. The computer usable or computer-readable medium may be, forexample but not limited to, an electronic, magnetic, optical,electromagnetic, infrared, or semiconductor system, apparatus, ordevice. More specific examples (e.g., a non-exhaustive list) of thecomputer-readable medium would include the following: an electricalconnection having one or more wires; a tangible medium such as aportable computer diskette, a hard disk, a time-dependent access memory(RAM), a read-only memory (ROM), an erasable programmable read-onlymemory (EPROM or Flash memory), a compact disc read-only memory(CD-ROM), or other tangible optical or magnetic storage device.

Computer program code/computer-readable instructions for carrying outoperations of embodiments of the present invention may be written in anobject oriented, scripted or unscripted programming language such asJAVA, PERL, SMALLTALK, C++, PYTHON or the like. However, the computerprogram code/computer-readable instructions for carrying out operationsof the invention may also be written in conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages.

Embodiments of the present invention are described below with referenceto flowchart illustrations and/or block diagrams of methods or systems.It will be understood that each block of the flowchart illustrationsand/or block diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerprogram instructions. These computer program instructions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce aparticular machine, such that the instructions, which execute by theprocessor of the computer or other programmable data processingapparatus, create mechanisms for implementing the functions/actsspecified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable memory that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablememory produce an article of manufacture including instructions, whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer orother programmable data processing apparatus to cause a series ofoperational events to be performed on the computer or other programmableapparatus to produce a computer implemented process such that theinstructions, which execute on the computer or other programmableapparatus, provide events for implementing the functions/acts specifiedin the flowchart and/or block diagram block or blocks. Alternatively,computer program implemented events or acts may be combined withoperator or human implemented events or acts in order to carry out anembodiment of the invention.

As the phrase is used herein, a processor may be “configured to” performor “configured for” performing a certain function in a variety of ways,including, for example, by having one or more general-purpose circuitsperform the function by executing particular computer-executable programcode embodied in computer-readable medium, and/or by having one or moreapplication-specific circuits perform the function.

Thus, according to embodiments of the invention, which will be describedin more detail below, systems, methods and computer program products aredisclosed for protecting the authenticity of data files and/or theowner/creator of a digital file through creation and registration ofuniversal tags on a distributed trust computing network. The presentinvention serves to detect and/or prevent wrongful alteration of digitalfiles and/or claims of ownership/creation by generating a uniqueuniversal tag and registering the universal tag with a distributed trust(e.g., computing network, which serves as a source of truth/verificationfor the universal tag. In this regard, a trusted entity (e.g.,government agency, financial institution or the like) may serve as theuniversal tag generator and registrar and the tag serves as the officialidentifier (e.g., fingerprint, birthmark or the like) for entirelifecycle of the data file.

In specific embodiments of the invention the universal tag is generatedby implementing a hash algorithm that uses one more input keys as theseed values. In specific embodiments of the invention, the input keysinclude one or more, and in some embodiments all of, (1) a first keycomprising a randomized digital representation of at least a portion ofthe data file, (2) a second key comprising data associated with at leastone selected from the group of (i) the user (e.g., digital signature ofthe user and biometric data and the like), and (ii) an origin of thedata file (e.g., a date, a time and/or a geographic location at whichthe data file was created), and (3) a third key comprising a randomizedinput provided by the validating entity.

Once the universal tag is generated it is registering through storageand validation within a distributed ledger of at least one distributedtrust computing network. The distributed trust computing network isconfigured to verify the universal tag and, in doing so, validates atleast one of (i) an authenticity of the data file, and (ii) the userassociated with the data file (e.g., rightful possessor and/or creatorof the digital file).

Turning now to the figures, FIG. 1 a schematic diagram is provided of anexemplary distributed trust computing network 100 otherwise referred toherein as a blockchain network or “block chain”, in accordance withembodiments of the present invention. The distributed trust computingnetwork 100 is a distributed database that maintains, e.g., a list ofdata records, or the like. In specific embodiments of the invention thedata records may include universal tags linked to data files, which areverified by the distributed trust computing network in terms of (i) theauthenticity of the data file, and/or (ii) the user associated with thedata file (e.g., rightful possessor and/or creator of the digital file).The security of the data maintained within the trust network is enhancedby the distributed nature of the network/block chain. The distributedtrust computing network 100 typically includes several nodes 110, whichmay be one or more systems, machines, computers, databases, data storesor the like operably connected with one another. In some instances, eachof the nodes 110 or multiple nodes 110 are maintained by differententities. A distributed trust computing network 100 typically workswithout a central repository or single administrator. One well-knownapplication of a distributed trust computing network/block chain is thepublic ledger of transactions for cryptocurrencies such as used inbitcoin. The data records recorded in the distributed trust computingnetwork/block chain are enforced cryptographically and stored on thenodes 100 of the block chain.

A distributed trust computing network 100 provides numerous advantagesover traditional storage networks/databases. A large number of nodes 110of a trust network may reach a consensus regarding the validity ofresources maintained with a block of the blockchain, in the context ofthe present invention the validity of a universal tag maintained on aledger 120. Additionally, when multiple versions of the universal tagexist on the ledger 120, multiple nodes 110 can converge on the mostup-to-date version of the universal tag, such that the most-up-to-dateversion of the universal tag is the only validated universal tag. Forexample, in the case of a universal tag, any node 110 within thedistributed trust computing network 100 that stores a record, such as auniversal tag, can determine within a level of certainty whether therecord can be authenticated/authorized to take place and become final byconfirming that no conflicting records are confirmed by the distributedtrust computing network/block chain elsewhere.

The blockchain chain typically has two primary types of records. Thefirst type is the record type, which consists of the actual data storedin a block 130 within a distributed ledger 120. The second type is theblock type, which are records that confirm when and in what sequencecertain events became recorded as part of the blockchain. Records, suchas a universal tags records, and the events associated therewith arecreated by participants using the blockchain in its normal course ofbusiness, for example, when a universal tag is received, a block(s) 130is created by users known as “miners” who use specializedsoftware/equipment to create blocks 130. Holders (also, referred to asusers) of a block 130 of the blockchain agree to store a universal tagwithin the distributed trust computing network 100 and the relateduniversal tag records are passed around to various nodes 110 of thedistributed trust computing network 100. A “valid” universal tag orrelated event is one that can be validated based on a set of rules thatare defined by the particular system implementing the distributed trustcomputing network/block chain. For example, in the case of universaltags, a valid universal tag is one that authenticates data in the datafile to which it is linked and/or the user/creator/owner of the datafile and authorizes entities to access the distributed ledger 120 togain access to the universal tag.

A distributed trust computing network/block chain 100 is typicallydecentralized-meaning that a distributed ledger 120 (i.e., adecentralized ledger) is maintained on multiple nodes 110 of the trustnetwork/block chain 100. One node 110 in the distributed trust computingnetwork 100/block chain may have a complete or partial copy of theentire ledger 120 or set of records and/or blocks 130 on the distributedtrust computing network 100/block chain. Events are initiated at a node110 of a distributed trust computing network 100/block chain andcommunicated to the various nodes 110 of the distributed trust computingnetwork 100/blockchain. Any of the nodes 110 can validate a universaltag/record or an associated event, add the universal tag/record or thedetails of the storage event to its copy of the distributed ledger 120,and/or broadcast the record or details of the storage event, itsassociated validation (in the form of a block 130) and/or other data toother nodes 110. The distributed trust computing network 100 shown inFIG. 1 is configured to perform one or more of the steps or functionsperformed by the system shown in FIG. 2, the computing platform shown inFIG. 4 and the methods described by FIGS. 5-6.

Referring to FIG. 2, a block diagram is presented of a system 200 forprotecting data by generating and registering within a distributed trustcomputing network a universal tag that is linked to a data file, inaccordance with embodiments of the present invention. The system 200includes a distributed trust computing network 100 as described inrelation to FIG. 1. The distributed trust computing network 100 includesa plurality of decentralized nodes 110. Each decentralized node 110having a first memory (not shown in FIG. 2) and at least one firstprocessor (not shown in FIG. 2) in communication with the first memory.The first memory of the decentralized nodes 110 is configured to storeat least a portion of a distributed ledger 120 that includes a pluralityof blocks 130-1-130-4. The processors of distributed trust computingnetwork 100 are configured to certify/validate that the blocks 130-3 ofdata are authentic and unaltered.

The system additionally includes a computing platform 400 disposedwithin a distributed communication network 200, such as the Internetand/or intranets. The computing platform 400 may comprise one or morecomputing devices, for example server(s) 402 or the like. In specificembodiments of the system, the computing platform 400 is under thecontrol of a trusted entity, such as a government agency, financialinstitution or the like. The computing platform 400 includes a secondmemory 404 and at least one second processor 406 in communication withthe second memory 404.

The second memory stored instructions 410 that are executable by secondprocessor 406. The instructions 410 are configured to receive one ormore keys/seeds that are used to generate a universal tag/code 440 for adata file. While the data file may include anything in digital form, inrelevant embodiments of the invention, the data file may include adocument to which a user is a party to (e.g., a binding contract, apurchase agreement, a birth certificate, a marriage license or the like)or intellectual property created or possessed by the user (e.g., music,video, digital work of visual art, literary work, formula/tradesecret/invention or the like). The one or more keys are subsequentlyapplied to a hash algorithm 430 or any other encryption means togenerate the universal tag 440/code.

The instructions 410 are configured to include registration instructions450 that are configured to register the universal tag 440 within a block130-3 of at least one distributed ledger 120 stored or accessible to oneor more distributed trust computing networks 100. The registering of theuniversal tag 440 within the distributed trust computing network 100provides for validating (i) the authenticity of the data file and/or(ii) the user as the rightful possessor/owner of the data file.

Referring to FIG. 3 a flow diagram is presented for generating auniversal tag and registering the tag within a distributed trustcomputing network, in accordance with embodiments of the presentinvention. In accordance with specific embodiments of the invention, thekeys/seed 420 used as the inputs to the has algorithm 430 for generatingthe universal tag 440 include first key 422, second key 424 and thirdkey 426.

First key 422 includes a randomized digital representation of at least aportion of the digital file. In this regard, the randomized digitalrepresentation may include any portion or segment of the digital file.For example, an initial clip of an audio or video file, the initialpages of a literary work/book or, in other embodiments, any clip of theaudio or video file or any pages/segments of the literary work/book. Inother embodiments of the invention the randomized digital representationmay include the entirety of the digital file. For example, a randomizeddigital representation of a binding contract, a birth certificate orother digital document associated with the user.

Second key 424 includes data associated with (i) the user and/or (ii)the origin of the data file. Data associated with the user may include,but is not limited to, biometric data (e.g., signature, voice, facialimage, fingerprint of the user). Data associated with the origin of thedata file may include, but is not limited to, a date/time at which thedata file was created/completed, a geographic location at which the datafile was created and the like.

Third key 426 includes a randomized input provided by the instructions410 or received by the validating entity (e.g., government agency,financial institution or the like).

The hash algorithm 430 used to generate universal tag 440 may be SHA-256(32 byte), SHA-512 (64 byte) or any other suitable has algorithm. Oncethe universal tag 440 has been created it may be subsequently de-hashedto validate the key(s), verify that the data file has not been tamperedwith and that the data in the data file is authenticate.

As previously discussed, the registration instructions 450 mayconfigured to store the universal tag 440 on one or more distributedledgers 120 stored within or accessible to one or more distributed trustcomputing networks 100. In other words, the registration instructions450 may register the universal tag 440 on multiple different distributedtrust computing networks 100.

Referring to FIG. 4 a block diagram is depicted of the computingplatform 400 configured for generating a universal tag linked to a datafile and registering the universal tag on a distributed trust computingnetwork, in accordance with embodiments of the present invention.Computing platform 400, which comprise one or more computing devices(e.g., personal computers, servers or the like), is configured toexecute instructions 410, such as algorithms, modules, routines,applications and the like. Computing platform 400 includes second memory404, which may comprise volatile and non-volatile memory, such asread-only and/or random-access memory (RAM and ROM), EPROM, EEPROM,flash cards, or any memory common to computing platforms). Moreover,second memory 404 may comprise cloud storage, such as provided by acloud storage service and/or a cloud connection service.

Further, computing platform 400 also includes at least one secondprocessor 406, which may be an application-specific integrated circuit(“ASIC”), or other chipset, logic circuit, or other data processingdevice. Second processor 406 may execute one or more applicationprogramming interface (APIs) 408 that interfaces with any residentprograms, such as instructions 410 or the like, stored in the secondmemory 404 of the computing platform 400 and any external programs.Second processor 406 may include various processing subsystems (notshown in FIG. 4) embodied in hardware, firmware, software, andcombinations thereof, that enable the functionality of computingplatform 400 and the operability of the computing platform 400 on thedistributed computing network 200 (shown in FIG. 2). For example,processing subsystems allow for initiating and maintainingcommunications and exchanging data with other networked devices. For thedisclosed aspects, processing subsystems of second processor 406 mayinclude any subsystem used in conjunction with instructions 410 andrelated tools, routines, sub-routines, algorithms, sub-algorithms,sub-modules thereof.

Computing platform 400 may additionally include a communications module(not shown in FIG. 4) embodied in hardware, firmware, software, andcombinations thereof, that enables electronic communications between thecomputing platform 400 and other network devices, such as those shown inFIG. 2. Thus, communication module may include the requisite hardware,firmware, software and/or combinations thereof for establishing andmaintaining a network communication connection with one or moredistributed trust.

Second memory 404 of computing platform 400 stores instructions 410configured to generate a universal tag linked to a data file andregister the universal tag within a distributed ledger of a distributedtrust computing network, in accordance with embodiments of the presentinvention. In specific embodiments of the invention the instructions 410may be implemented by a trusted entity, such as a government agency,financial institution or the like.

The instructions 410 are configured to receive one or more keys/seeds420 configured for generating a universal tag 440 linked to a data file460. As previously discussed, the data file 460 may include acontract/certificate 462 document to which a user is a party to (e.g., abinding contract, a purchase agreement, a birth certificate, a marriagelicense or the like) or intellectual property 464 created or possessedby the user (e.g., music, video, digital work of visual art, literarywork, formula/trade secret/invention or the like).

As discussed in relation to FIG. 3, the one or more keys/seeds 420 mayinclude one or more, and in specific embodiments all of, a first key422, a second key 424 and a third key 426. First key 422 includes arandomized digital representation of at least a portion of the digitalfile. Second key 424 includes data associated with (i) the user and/or(ii) the origin of the data file. Third key 426 includes a randomizedinput provided by the instructions 410 or received by the validatingentity (e.g., government agency, financial institution or the like). Inother embodiments of the invention, one or more other keys 428 may beused to generate the universal tag 440.

In response to receiving the one or more keys 420, the instructions 410are further configured to apply the one or more keys to a hash algorithm430 to generate the universal tag 440. By way of example only, the hashalgorithm may be SHA-256 (32 bytes), SHA-512 (64 bytes) or the like.

In response to generating the universal tag 440, registrationinstructions 450 are executed to register the universal tag 440 within ablock 130 of one or more distributed ledgers 120 stored within oraccessible to one or more distributed trust computing networks 100. Aspreviously discussed, the registering of the universal tag 100 withinthe distributed computing network 100 provides for verifying thevalidity of (i) the data file and/or (ii) the user (i.e.,creator/rightful possessor) associated with the data file. Thus,registering the universal tag 440 within the distributed trust computingnetwork 110 serves to subsequently, upon accessing the universal tag 440within the trust network 100, confirm that the data has been not beentampered with in the data file and/or verify that the user is therightful creator and/or possessor of the data file.

In optional embodiments of the invention, instructions 410 may befurther configured to generate a coded representation 480 of theuniversal tag 440 (e.g., a hyperlink, a barcode, QR code or the like)and, in further specific embodiments of the invention, embed the codedrepresentation 480 in a digital reproduction of the data file 470 (i.e.,a data file other than the original data file). The coded representation480 may be embedded as visible coded representation (e.g., embeddedwithin/affixed to a document) or the coded representation may beinvisible (e.g., embedded with an audio or visual data file). Inspecific embodiments of the invention, the coded representation 480 isconfigured to provide access to the universal tag 440 stored within thedistributed trust computing network 100 and, if the accessor possess thede-hash key (typically provided by the user), the accessor is able tovalidate that the data in the data file has not been tampered withand/or that the user is the creator/rightful possessor.

In further specific embodiments of the invention, the instructions 410include sporadic tag generator instructions 490 configured tosporadically/periodically generate a current universal tag 498 linked todata file 460 and register the current universal tag 498 within a block130 of one or more distributed ledgers 120 stored within or accessibleto a distributed trusts computing network 100. The sporadic/periodgeneration of universal tags may occur at a predetermined time interval492 (e.g., milliseconds to hours intervals) or may occur on-demand 494of the user and/or the trusted validating entity (e.g. governmentagency, financial institution or the like). By providing for a universaltag that constantly is changing, the present invention adds anadditional layer of data protection, specifically preventing a wrongdoerwho has decoded the hash algorithm from claiming possession/creation ofthe digital file or the like.

The sporadic tag generator instructions 490 include key alterationinstructions 496 configured to alter, at the predetermined interval 492or on-demand 494, at least one key/seed 420 used to generate alast-in-time universal tag 440 linked to a data file 460. In specificembodiments of the invention, altering at least one key may includealtering the first key 422 by changing the portion of the digital filethat is digitally represented, and/or altering the second key 424 bychanging the user data and/or origin data, and/or altering the third keyby changing the randomized input provided by the instructions 410 orreceived by the validating entity. Once the one or more keys have beenaltered, the keys 420 included the altered keys are applied to the hashalgorithm 430 to generate a current universal tag 498. In response togenerating the current universal tag 498, the current universal tag 498is registered within a block 130 of the one or more distributed ledger120 stored or accessible to the one or more distributed trust computingnetworks 100. The registration of the current universal tag 498 servesto supersede the registration of the last-in-time universal tag, suchthat, the last-in-time universal tag no longer serves to validate the(i) the integrity of the data in the data file 460 and/or (ii) the useras the creator/rightful possessor of the data file 460.

Referring to FIG. 4 a flow diagram is presented of a method 500 for dataprotection that includes generating a universal tag linked to a datafile and registering the tag within a distributed trust computingnetwork, in accordance with embodiments of the present invention. AtEvent 510, one or more keys/seeds are received that are configured forgenerating a universal tag linked to a data file that is associated witha user. The data files may include a document or the like to which theuser is a party to or intellectual property created by or rightfullypossessed by the user. In specific embodiments of the method, the one ormore keys include at least one, and in some embodiments all of, a firstkey this includes a randomized digital representation of at least aportion of the digital file, a second key that includes data associatedwith (i) the user and/or (ii) the origin of the data file and a thirdkey that includes a randomized input provided by the a random generatoror the validating entity.

At Event 520, in response to receiving the one or more keys/seed, thekeys/seeds are applied to a has algorithm to generate a universal tag,otherwise referred to a universal tag or the like. The has algorithm maybe any conventional has algorithm, for example, SHA-256 (32 byte),SHA-512 (64 byte) or the like.

At Event 530, the universal tag is registered within a block of at leastone distributed ledger stored within or accessible to at leastdistributed trust computing network. The registering of the universaltag within the distributed trust computing network provides forvalidating at least one of (i) the authenticity of the data file, and/or(ii) the user associated with the data file (e.g., the creator and/orrightful possessor of the data file.

In alternate embodiments of the method, not shown in FIG. 5, a codedrepresentation (e.g., hyperlink, barcode, Quick Response (QR) code) ofthe universal tag may be generated and, in further alternateembodiments, the coded representation may be embedded, visually orcovertly, within a digital reproduction of the data file. In otheralternate embodiments of the method, the universal tag is applied to thehash algorithm (i.e., de-hashing) to validate the keys (i.e., verifythat the data has not been tampered with and/or verify the user as thecreator/rightful possessor). In other alternate embodiments of themethod, a digital representation of the data file is stored along withthe universal tag within the block of distributed ledger or within aseparate block of the distributed ledger. In such embodiments of themethod, a coded representation of the universal tag may generated which,when de-coded, provides access to the digital representation of the datafile stored within at least one distributed trust computing networks andvalidation of at least one selected from the group of (i) theauthenticity of the data file, and (ii) the user associated with thedata file.

Referring to FIG. 6 a flow diagram is depicted of a method 600 forprotecting data by sporadically/periodically generating universal tagsand registering such within a distributed trust computing network, inaccordance with embodiment of the present invention. At Event 702, atleast one key/seed that was used to generate a last-in-time universalkey linked to a data file is altered. As previously discussed, the datafile may be a document to which a user is a party to or intellectualproperty created by or rightfully possessed by the user. In specificembodiments of the method, the one or more keys include at least one,and in some embodiments all of, a first key this includes a randomizeddigital representation of at least a portion of the digital file, asecond key that includes data associated with (i) the user and/or (ii)the origin of the data file and a third key that includes a randomizedinput provided by the a random generator or the validating entity. This,altering the one or more keys may include, but is not limited to,altering the first key by changing the portion of the digital file thatis digitally represented, and/or altering the second key by changing theuser data and/or origin data, and/or altering the third key by changingthe randomized input provided by a random generator and/or thevalidating entity.

In response to altering the one or more keys, at Event 620, the keysincluding the one or more altered keys are applied to the hash algorithmto generate a current universal tag. As previously discussed, thealtering of the key(s) and generation of universal tags occurssporadically/periodically on a predetermined schedule and/or on-demandof the user and/or validating entity. In those embodiments in which thealtering of the key(s) and generation of universal tags occurson-demand, the need to change universal tags may be triggered by actionassociated with the data file that has jeopardized the integrity of thedata file.

In response to generating the current universal tag, at Event 630, thecurrent universal tag is registered within a block of at least onedistributed ledger stored within or accessible to at least onedistributed trust computing network. Registering of the currentuniversal tag provides for superseding the last-in-time registereduniversal tag, such that, the last-in-time registered universal tag isno longer effective for validating the integrity of the data file and/orthe user associated with the data file. In other words, registering thecurrent universal tag provides for the current universal tag to providevalidation for the (i) integrity of the data file, and/or (ii) the useras creator/rightful possessor the data file.

In alternate embodiments of the method, not shown in FIG. 6, the blocksof the distributed ledger that store the universal tags blocks of the atleast one distributed computing network that store registered universaltags provide for an accessible historical database that indicates a timeperiod for which each of the registered universal tags was, in effect, acurrent registered universal tag (i.e., a validating universal tag). Inother alternate embodiments of the method, a digital representation ofthe data file is stored along with the universal tag within the block ofdistributed ledger or within a separate block of the distributed ledger.In such embodiments of the method, a coded representation of the currentuniversal tag may generated which, when de-coded, provides access to thedigital representation of the data file stored within at least onedistributed trust computing networks and validation of at least oneselected from the group of (i) the authenticity of the data file, and(ii) the user associated with the data file.

Thus, present embodiments of the invention provide for a universal tagwhich is linked to the content of a data file for protecting theauthenticity of the data file and/or the owner/creator of a digitalfile. The universal tag is linked to the content in the data file viaone or more input keys/seeds that are used to generate the universal tagand rely on data associated with the content. Once generated, theuniversal tag is registered on a distributed ledger of at least ondistributed trust computing network, which acts as a source of truth tovalidate the universal tag and, as such, validate (i) an authenticity ofthe data file, and/or (ii) the user associated with the data file (e.g.,rightful possessor and/or creator of the digital file).

While certain exemplary embodiments have been described and shown in theaccompanying drawings, it is to be understood that such embodiments aremerely illustrative of and not restrictive on the broad invention, andthat this invention not be limited to the specific constructions andarrangements shown and described, since various other changes,combinations, omissions, modifications and substitutions, in addition tothose set forth in the above paragraphs, are possible.

Those skilled in the art may appreciate that various adaptations andmodifications of the just described embodiments can be configuredwithout departing from the scope and spirit of the invention. Therefore,it is to be understood that, within the scope of the appended claims,the invention may be practiced other than as specifically describedherein.

What is claimed is:
 1. A system for data protection, the systemcomprising: at least one distributed trust computing network comprisinga plurality of decentralized nodes, each decentralized node having afirst memory and at least one first processor in communication with thememory, wherein the first memory of the decentralized nodes isconfigured to store at least one distributed ledger comprising aplurality of blocks of data; and a computing platform disposed in adistributed computing network and including a second memory and at leastone second processor in communication with the second memory, whereinthe second memory stores instructions that are executable by the secondprocessor and configured to: receive one or more keys configured forgenerating a universal tag that is linked to a data file associated witha user; apply the one or more keys to a hash algorithm to generate theuniversal tag; and register the universal tag within a block of at leastone distributed ledger stored or accessible to one or more of the atleast one distributed trust computing networks, wherein the registeringof the universal tag within the one or more distributed trust computingnetworks provides for validating at least one selected from the group of(i) an authenticity of the data file, and (ii) the user associated withthe data file.
 2. The system of claim 1, wherein the one or more keysinclude a key comprising a randomized digital representation of at leasta portion of the data file.
 3. The system of claim 1, wherein the one ormore keys include a key comprising data associated with at least oneselected from the group of (i) the user, and (ii) an origin of the datafile.
 4. The system of claim 3, wherein the key further comprises dataassociated with the user including one or more of a digital signature ofthe user and biometric data from the user.
 5. The system of claim 3,wherein the key further comprises data associated with the origin of thedata file including one or more of a date, a time and a geographiclocation at which the data file was created.
 6. The system of claim 1,wherein the one or more keys include a key comprising a randomized inputprovided by the instructions or a validating entity.
 7. The system ofclaim 1, wherein the one or more keys comprises: a first key comprisinga randomized digital representation of at least a portion of the datafile, a second key comprising data associated with at least one selectedfrom the group of (i) the user, and (ii) an origin of the data file, anda third key comprising a randomized input provided by (i) theinstructions or (ii) a validating entity.
 8. The system of claim 1,wherein the data file associated with the user is one of (i) a documentto which the user is a party to, or (ii) intellectual property createdby the user.
 9. The system of claim 1, wherein the instructions arefurther configure to create a coded representation of the universal tag,wherein the coded representation is configured to be decoded to providevalidation of at least one selected from the group of (i) theauthenticity of the data file, and (ii) the user associated with thedata file.
 10. The system of claim 9, wherein the instructions arefurther configured to embed the coded representation within digitalreproductions of the data file.
 11. The system of claim 1, wherein theinstructions are further configured to apply the universal tag to thehash algorithm to validate the one or more keys.
 12. Acomputer-implemented method for data protection, thecomputer-implemented method is implemented by one or more processingdevices and comprises: receiving one or more keys configured forgenerating a universal tag linked to a data file associated with a user;applying the one or more keys to a hash algorithm to generate theuniversal tag; and registering the universal tag within a block of atleast one distributed ledger stored or accessible to one or moredistributed trust computing networks, wherein the registering of theuniversal tag within the one or more the distributed trust computingnetworks provides for validating at least one selected from the group of(i) an authenticity of the data file, and (ii) the user associated withthe data file.
 13. The computer-implemented method of claim 12, whereinreceiving one or more keys further comprises receiving a key comprisinga randomized digital representation of at least a portion of the datafile.
 14. The computer-implemented method of claim 12, wherein receivingone or more keys further comprises receiving a key comprising dataassociated with at least one selected from the group of (i) the user,and (ii) an origin of the data file.
 15. The computer-implemented methodof claim 12, wherein receiving one or more keys further comprisesreceiving a key comprising a randomized input provided by theinstructions or a validating entity.
 16. The computer-implemented methodof claim 12, wherein receiving the one or more keys further comprisesreceiving a first key comprising a randomized digital representation ofat least a portion of the data file, a second key comprising dataassociated with at least one selected from the group of (i) the user,and (ii) an origin of the data file, and a third key comprising arandomized input provided by a validating entity.
 17. Thecomputer-implemented method of claim 12, further comprising creating acoded representation of the universal tag, wherein the codedrepresentation is configured to be decoded to provide validation of atleast one selected from the group of (i) the authenticity of the datafile, and (ii) the user associated with the data file.
 18. Thecomputer-implemented method of claim 17, further comprising embeddingthe coded representation within digital reproductions of the data file.19. A computer program product including a non-transitorycomputer-readable medium, the computer-readable medium comprising: afirst set of codes for causing a computer to receive one or more keysconfigured for generating a universal tag linked to a data fileassociated with a user; a second set of codes for causing a computer toapply the one or more keys to a hash algorithm to generate the universaltag; and a third set of codes for causing a computer to register theuniversal tag within a block of at least one distributed ledger storedor accessible to one or more distributed trust computing networks,wherein the registering of the universal tag within the one or more thedistributed trust computing networks provides for validating at leastone selected from the group of (i) an authenticity of the data file, and(ii) the user associated with the data file.
 20. The computer programproduct of claim 19, wherein the first set of codes is furtherconfigured to cause the computer to receive at least one of selectedfrom the group of receiving (1) a first key comprising a randomizeddigital representation of at least a portion of the data file, (2) asecond key comprising data associated with at least one selected fromthe group of (i) the user, and (ii) an origin of the data file, and (3)a third key comprising a randomized input provided by a validatingentity.